Search results for "Bifurcating Markov chains"

showing 6 items of 6 documents

CENTRAL LIMIT THEOREM FOR KERNEL ESTIMATOR OF INVARIANT DENSITY IN BIFURCATING MARKOV CHAINS MODELS

2021

Bifurcating Markov chains (BMC) are Markov chains indexed by a full binary tree representing the evolution of a trait along a population where each individual has two children. Motivated by the functional estimation of the density of the invariant probability measure which appears as the asymptotic distribution of the trait, we prove the consistence and the Gaussian fluctuations for a kernel estimator of this density based on late generations. In this setting, it is interesting to note that the distinction of the three regimes on the ergodic rate identified in a previous work (for fluctuations of average over large generations) disappears. This result is a first step to go beyond the thresh…

[MATH.MATH-PR]Mathematics [math]/Probability [math.PR][MATH.MATH-PR] Mathematics [math]/Probability [math.PR]fluctuations for tree indexed Markov chain60J8060J05[STAT.TH] Statistics [stat]/Statistics Theory [stat.TH]Bifurcating Markov chains60F05binary trees[STAT.TH]Statistics [stat]/Statistics Theory [stat.TH]bifurcating auto-regressive process62F12density estimation Mathematics Subject Classification (2020): 62G05
researchProduct

MODERATE DEVIATION PRINCIPLES FOR BIFURCATING MARKOV CHAINS: CASE OF FUNCTIONS DEPENDENT OF ONE VARIABLE

2021

The main purpose of this article is to establish moderate deviation principles for additive functionals of bifurcating Markov chains. Bifurcating Markov chains are a class of processes which are indexed by a regular binary tree. They can be seen as the models which represent the evolution of a trait along a population where each individual has two offsprings. Unlike the previous results of Bitseki, Djellout \& Guillin (2014), we consider here the case of functions which depend only on one variable. So, mainly inspired by the recent works of Bitseki \& Delmas (2020) about the central limit theorem for general additive functionals of bifurcating Markov chains, we give here a moderate deviatio…

Statistics and Probability[MATH.MATH-PR]Mathematics [math]/Probability [math.PR][MATH.MATH-PR] Mathematics [math]/Probability [math.PR]60J80Bifurcating Markov chainsbinary trees[MATH]Mathematics [math]binary trees Mathematics Subject Classification (2020): 60F10deviation inequalitiesMathematics - Probabilitymoderate deviation principles
researchProduct

MODERATE DEVIATION PRINCIPLES FOR KERNEL ESTIMATOR OF INVARIANT DENSITY IN BIFURCATING MARKOV CHAINS MODELS

2021

Bitseki and Delmas (2021) have studied recently the central limit theorem for kernel estimator of invariant density in bifurcating Markov chains models. We complete their work by proving a moderate deviation principle for this estimator. Unlike the work of Bitseki and Gorgui (2021), it is interesting to see that the distinction of the two regimes disappears and that we are able to get moderate deviation principle for large values of the ergodic rate. It is also interesting and surprising to see that for moderate deviation principle, the ergodic rate begins to have an impact on the choice of the bandwidth for values smaller than in the context of central limit theorem studied by Bitseki and …

[MATH.MATH-PR]Mathematics [math]/Probability [math.PR]60J80[MATH.MATH-PR] Mathematics [math]/Probability [math.PR]Bifurcating Markov chains[STAT.TH] Statistics [stat]/Statistics Theory [stat.TH]binary trees[STAT.TH]Statistics [stat]/Statistics Theory [stat.TH]bifurcating auto-regressive process62F12density estimation Mathematics Subject Classification (2020): 62G0560F10
researchProduct

Central limit theorem for bifurcating Markov chains under L 2 -ergodic conditions

2021

Bifurcating Markov chains (BMC) are Markov chains indexed by a full binary tree representing the evolution of a trait along a population where each individual has two children. We provide a central limit theorem for additive functionals of BMC under L 2-ergodic conditions with three different regimes. This completes the pointwise approach developed in a previous work. As application, we study the elementary case of symmetric bifurcating autoregressive process, which justify the non-trivial hypothesis considered on the kernel transition of the BMC. We illustrate in this example the phase transition observed in the fluctuations.

fluctuations for tree indexed Markov chain60J80[MATH.MATH-PR] Mathematics [math]/Probability [math.PR]Bifurcating Markov chains60F05binary treesbifurcating auto-regressive processdensity estimation Mathematics Subject Classification (2020): 60J05
researchProduct

CENTRAL LIMIT THEOREM FOR BIFURCATING MARKOV CHAINS

2020

Bifurcating Markov chains (BMC) are Markov chains indexed by a full binary tree representing the evolution of a trait along a population where each individual has two children. We first provide a central limit theorem for general additive functionals of BMC, and prove the existence of three regimes. This corresponds to a competition between the reproducing rate (each individual has two children) and the ergodicity rate for the evolution of the trait. This is in contrast with the work of Guyon (2007), where the considered additive functionals are sums of martingale increments, and only one regime appears. Our first result can be seen as a discrete time version, but with general trait evoluti…

[MATH.MATH-PR]Mathematics [math]/Probability [math.PR][MATH.MATH-PR] Mathematics [math]/Probability [math.PR]fluctuations for tree indexed Markov chain60J80[STAT.TH] Statistics [stat]/Statistics Theory [stat.TH]Bifurcating Markov chains60F05binary trees62G05[STAT.TH]Statistics [stat]/Statistics Theory [stat.TH]bifurcating auto-regressive process62F12density estimation Mathematics Subject Classification (2020): 60J05
researchProduct

KERNEL ESTIMATION OF THE TRANSITION DENSITY IN BIFURCATING MARKOV CHAINS

2023

We study the kernel estimator of the transition density of bifurcating Markov chains. Under some ergodic and regularity properties, we prove that this estimator is consistent and asymptotically normal. Next, in the numerical studies, we propose two data-driven methods to choose the bandwidth parameters. These methods are based on the so-called two bandwidths approach.

cross validation methodKernel estimatorrule of thumb type methodasymptotic normalitybinary trees[MATH.MATH-ST] Mathematics [math]/Statistics [math.ST]bifurcating Markov chains[STAT] Statistics [stat]
researchProduct